On Some Recognizable Picture-Languages
نویسنده
چکیده
We show that the language of pictures over fa; bg, where all occurring b's are connected is recognizable, which solves an open problem in Mat98]. We generalize the used construction to show that monocausal deterministically recognizable picture languages are recognizable, which is surprisingly nontrivial. Furthermore we show that the language of pictures over fa; bg, where the number of a's is equal to the number of b's is nonuniformly recognizable.
منابع مشابه
Local and recognizable hexagonal picture languages
In this paper we introduce hexagonal Wang tiles, local hexagonal picture languages, and recognizable hexagonal picture languages. We use hexagonal Wang tiles to introduce hexagonal Wang systems(HWS), a formalism to recognize hexagonal picture languages. It is noticed that the family of hexagonal picture languages defined by hexagonal Wang systems coincides with the family of hexagonal picture l...
متن کاملA Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
The theory of one-dimensional (word) languages is well founded and investigated since fifties. From several years, the increasing interest for pattern recognition and image processing motivated the research on two-dimensional or picture languages, and nowadays this is a research field of great interest. A first attempt to formalize the concept of finite state recognizability for twodimensional ...
متن کاملAmbiguity and Complementation in Recognizable Two-dimensional Languages
The theory of one-dimensional (word) languages is well founded and investigated since fifties. From several years, the increasing interest for pattern recognition and image processing motivated the research on two-dimensional or picture languages, and nowadays this is a research field of great interest. A first attempt to formalize the concept of finite state recognizability for two-dimensional...
متن کاملRecognizable Picture Languages and Domino Tiling
In [2], Giammarresi and Restivo define the notion of local picture languages by giving a set of authorized 2 x 2 tiles over C U {#} where # is a boundary symbol which surrounds the pictures. Then they define the class of recognizable picture languages as the set of languages which can be obtained by projection of a local one. This class is of interest since it admits several quite different cha...
متن کاملOn the Complexity of Unary Tiling-Recognizable Picture Languages
We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary strings to represent unary pictures and we prove that any unary picture language L is in Rec1 if and only if the set of all quasi-unary strings encoding the elements of L is recognizable by a one-tape nondeterministic Turing m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998